Dependently Typed Programming with Domain-Specific Logics (Thesis Proposal DRAFT)
نویسنده
چکیده
We propose a thesis defending the following statement: The logical notions of polarity and focusing provide a foundation for dependently typed programming with domain-specific logics, with applications to certified software and mechanized metatheory.
منابع مشابه
Abstract: Dependently Typed Programming with Domain-Specific Logics
Dependently Typed Programming with Domain-Specific Logics
متن کاملDependently Typed Programming with Domain-Specific Logics
This dissertation describes progress on programming with domain-specific specification logics in dependently typed programming languages. Domain-specific logics are a promising way to verify software, using a logic tailored to a style of programming or an application domain. Examples of domain-specific logics include separation logic, which has been used to verify imperative programs, and autho...
متن کاملGeneric Programming within Dependently Typed Programming
We show how higher kinded generic programming can be represented faithfully within a dependently typed programming system. This development has been implemented using the Oleg system. The present work can be seen as evidence for our thesis that extensions of type systems can be done by programming within a dependently typed language, using data as codes for types.
متن کاملTyped Logics With States
The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a well-known result of Friedman for typed lambda calculus). This system is next extended to a full fledged typed dynamic logic, and it is illustrated how the ...
متن کاملCombining Proofs and Programs in a Dependently Typed Language ( With technical appendix )
Most dependently-typed p rogramming languages either require that all expressions terminate (e.g. Coq, Agda, and Epigram), or allow infinite loops but are inconsistent when viewed as logics (e.g. Haskell, ATS, Ωmega). Here, we combine these two approaches into a single dependently-typed core language. The language is composed of two fragments t hat share a common syntax and overlapping semantic...
متن کامل